Planar graphs on the projective plane
نویسندگان
چکیده
It is shown that embeddings of planar graphs in the projective plane have very specific structure. By exhibiting this structure we indirectly characterize graphs on the projective plane whose dual graphs are planar. Whitney's Theorem about 2-switching equivalence of planar embeddings is generalized: Any two embeddings of a planar graph in the projective plane can be obtained from each other by means of simple local reembeddings, very similar to Whitney's switchings.
منابع مشابه
$n$-Array Jacobson graphs
We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.
متن کاملObstruction Sets for Outer-Projective-Planar Graphs
A graph G is outer projective planar if it can be embedded in the projective plane so that every vertex appears on the boundary of a single face We exhibit obstruction sets for outer projective planar graphs with respect to the subdivision minor and Y orderings Equivalently we nd the minimal non outer projective planar graphs under these orderings
متن کاملOn cographic matroids and signed-graphic matroids
We prove that a connected cographic matroid of a graph G is the bias matroid of a signed graph Σ iff G imbeds in the projective plane. In the case that G is nonplanar, we also show that Σ must be the projective-planar dual signed graph of an actual imbedding of G in the projective plane. As a corollary we get that, if G1, . . . , G29 denote the 29 nonseparable forbidden minors for projective-pl...
متن کاملLight subgraphs of graphs embedded in the plane and in the projective plane – a survey –
It is well known that every planar graph contains a vertex of degree at most 5. A theorem of Kotzig states that every 3-connected planar graph contains an edge whose endvertices have degree-sum at most 13. Recently, Fabrici and Jendrol’ proved that every 3-connected planar graph G that contains a k-vertex path, a path on k vertices, contains also a k-vertex path P such that every vertex of P ha...
متن کاملThe structure and labelled enumeration of K_{3,3}-subdivision-free projective-planar graphs
We consider the class F of 2-connected non-planar K3,3-subdivision-free graphs that are embeddable in the projective plane. We show that these graphs admit a unique decomposition as a graph K5 (the core) where the edges are replaced by two-pole networks constructed from 2-connected planar graphs. A method to enumerate these graphs in the labelled case is described. Moreover, we enumerate the ho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 149 شماره
صفحات -
تاریخ انتشار 1996